Clique-Width is NP-Complete
نویسندگان
چکیده
Clique-width is a graph parameter that measures in a certain sense the complexity of a graph. Hard graph problems (e.g., problems expressible in Monadic Second Order Logic with second-order quantification on vertex sets, that includes NP-hard problems such as 3-colorability) can be solved in polynomial time for graphs of bounded clique-width. We show that the clique-width of a given graph cannot be absolutely approximated in polynomial time unless P = NP. We also show that, given a graph G and an integer k, deciding whether the clique-width of G is at most k is NP-complete. This solves a problem that has been open since the introduction of clique-width in
منابع مشابه
Proving NP-hardness for clique-width I: non-approximability of sequential clique-width
Clique-width is a graph parameter, defined by a composition mechanism for vertexlabeled graphs, which measures in a certain sense the complexity of a graph. Hard graph problems (e.g., problems expressible in Monadic Second Order Logic, that includes NPhard problems) can be solved efficiently for graphs of certified small clique-width. It is widely believed that determining the clique-width of a...
متن کاملProving NP-hardness for clique-width II: non-approximability of clique-width
Clique-width is a graph parameter that measures in a certain sense the complexity of a graph. Hard graph problems (e.g., problems expressible in Monadic Second Order Logic with second-order quantification on vertex sets, that includes NP-hard problems) can be solved efficiently for graphs of certified small clique-width. It is widely believed that determining the clique-width of a graph is NP-h...
متن کاملOn the Complete Width and Edge Clique Cover Problems
A complete graph is the graph in which every two vertices are adjacent. For a graph G = (V,E), the complete width of G is the minimum k such that there exist k independent sets Ni ⊆ V , 1 ≤ i ≤ k, such that the graph G obtained from G by adding some new edges between certain vertices inside the sets Ni, 1 ≤ i ≤ k, is a complete graph. The complete width problem is to decide whether the complete...
متن کاملMulticut on Graphs of Bounded Clique-Width
Several variants of Multicut problems arise in applications like circuit and network design. In general, these problems are NP-complete. The goal of our work is to investigate the potential of clique-width for identifying tractable fragments of Multicut. We show for several parameterizations involving clique-width whether they lead to tractability or not. Since bounded tree-width implies bounde...
متن کاملA Width Parameter Useful for Chordal and Co-comparability Graphs
In 2013 Belmonte and Vatshelle used mim-width, a graph parameter bounded on interval graphs and permutation graphs that strictly generalizes clique-width, to explain existing algorithms for many domination-type problems, also known as (σ, ρ)problems or LC-VSVP problems, on many special graph classes. In this paper, we focus on chordal graphs and co-comparability graphs, that strictly contain in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Discrete Math.
دوره 23 شماره
صفحات -
تاریخ انتشار 2009